On Induced Paths, Holes and Trees in Random Graphs
نویسندگان
چکیده
We study the concentration of the largest induced paths, trees and cycles (holes) in the Erdos-Renyi random graph model and prove a 2-point concentration for the size of the largest induced path and hole, for all p = Ω(n ln n). As a corollary, we obtain an improvement over a result of Erdos and Palka concerning the size of the largest induced tree in a random graph. Further, we study the path chromatic number and tree chromatic number i.e. the smallest number of parts into which the vertex set of a graph can be partitioned such that every The arguments involve the application of a modified version of a probabilistic inequality of Krivelevich, Sudakov, Vu and Wormald.
منابع مشابه
Snakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملLarge Holes in Quasi-Random Graphs
Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths ...
متن کاملGraphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II
Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P , and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P . These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least 3 in their u...
متن کاملAsymptotic behaviour of associated primes of monomial ideals with combinatorial applications
Let $R$ be a commutative Noetherian ring and $I$ be an ideal of $R$. We say that $I$ satisfies the persistence property if $mathrm{Ass}_R(R/I^k)subseteq mathrm{Ass}_R(R/I^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{Ass}_R(R/I)$ denotes the set of associated prime ideals of $I$. In this paper, we introduce a class of square-free monomial ideals in the polynomial ring $R=K[x_1,ld...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018